Point compression for the trace zero subgroup over a small degree extension field
نویسندگان
چکیده
منابع مشابه
Point compression for the trace zero subgroup over a small degree extension field
Using Semaev’s summation polynomials, we derive a new equation for the Fqrational points of the trace zero variety of an elliptic curve defined over Fq. Using this equation, we produce an optimal-size representation for such points. Our representation is compatible with scalar multiplication. We give a point compression algorithm to compute the representation and a decompression algorithm to re...
متن کاملAn optimal representation for the trace zero subgroup
We give an optimal-size representation for the elements of the trace zero subgroup of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field extension of any prime degree. The representation is via the coefficients of a rational function, and it is compatible with scalar multiplication of points. We provide efficient compression and decompression algorithms...
متن کاملQ-adic Floating-point Transform revisited: arithmetic over small extension field via floating point routines
We present an algorithm to perform arithmetic operations over small extension field via numerical routines. The idea is to convert the X-adic representation of modular polynomials, with X an indeterminate, to a q-adic representation where q is a prime power larger than the field characteristic. With some control on the different involved sizes it is then possible to perform some of the q-adic a...
متن کاملScalar multiplication in compressed coordinates in the trace-zero subgroup
We consider trace-zero subgroups of elliptic curves over a degree three field extension. The elements of these groups can be represented in compressed coordinates, i.e. via the two coefficients of the line that passes through the point and its two Frobenius conjugates. In this paper we give the first algorithm to compute scalar multiplication in the degree three trace-zero subgroup using these ...
متن کاملCompression for trace zero points on twisted Edwards curves
We propose two optimal representations for the elements of trace zero subgroups of twisted Edwards curves. For both representations, we provide efficient compression and decompression algorithms. The efficiency of the algorithm is compared with the efficiency of similar algorithms on elliptic curves in Weierstrass form.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2014
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-014-9921-0